#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <list>
#include <algorithm>
using namespace std;

const int MAX_R = 9;
const int MAX_S = 81;
int a[MAX_R+2][MAX_S+2];

int main() {
    int S;
    scanf("%d", &S);

    for (int j = 0; j <= S; ++j) {
        if (j < 10)
            a[1][j] = 1;
        else
            a[1][j] = 0;
    }

    for (int j = 0; j <= S; ++j) {
        for (int i = 2; i <= 10; ++i) {
            int tmp = 0;
            const int maxk = (i == 10) ? 1 : 9;
            for (int k = 1; k <= maxk; ++k) {
                const int p = j - k;
                if (p == 0)
                    tmp += 1;
                else if (p > 0) {
                    for (int l = 1; l < i; ++l)
                        tmp += a[l][p];
                }
            }

            a[i][j] = tmp;
        }
    }

    /*for (int i = 1; i <= 10; ++i) {
        if (i == 1) {
            for (int j = 0; j <= S; ++j)
                cout << j << "\t";
            cout << endl << "-----------------------------------------------------------------------------------------------------" << endl;
            cout << endl;
        }

        for (int j = 0; j <= S; ++j)
            cout << a[i][j] << "\t";
        cout << endl;
    }*/

    int res = 0;
    for (int i = 1; i <= 9; ++i)
        res += a[i][S];
    if (S == 1)
        ++res;
    printf("%d\n", res);
    
    return 0;
}
